Polynomial-time algorithms for special cases of the maximum confluent flow problem

Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem Improved Time Bounds for the Maximum Flow Problem

Recently, Goldberg proposed a new approach lo the maximum netv.ork flow problem. The approach yields a ver>' simple algorithm nmning in 0{n^) time on n-vertex networks. Incorporation of the dynamic tree data structure of Sleator and Tarjan yields a more complicated algorithm with a running time of 0{rvn log {n^ Im)) on m-arc networks. Ahuja and Orlin developed a variant of Goldberg's algorithm ...

Two polynomial algorithms for special maximum matching constructing in trees

For an arbitrary tree we investigate the problems of constructing a maximum matching which minimizes or maximizes the cardinality of a maximum matching of the graph obtained from original one by its removal and present corresponding polynomial algorithms.

Strongly Polynomial Algorithms for the Unsplittable Flow Problem

Parametric Maximum Flow Problem: Techniques and Algorithms

PARAMETRIC MAXIMUM FLOW PROBLEM: TECHNIQUES AND ALGORITHMS Deepika Sareen and Deepak Garg Thapar University, Patiala E-mails: [email protected], [email protected] We encounter many different types of networks in our everyday lives, including electrical, telephone, cable, highway, rail, manufacturing and computer networks. Networks consist of special points called nodes and links connecti...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.